Oversampling and reconstruction functions with compact support
نویسندگان
چکیده
منابع مشابه
A new class of radial basis functions with compact support
Radial basis functions are well-known and successful tools for the interpolation of data in many dimensions. Several radial basis functions of compact support that give rise to nonsingular interpolation problems have been proposed, and in this paper we study a new, larger class of smooth radial functions of compact support which contains other compactly supported ones that were proposed earlier...
متن کاملConvolution Roots of Radial Positive Definite Functions with Compact Support
A classical theorem of Boas, Kac, and Krein states that a characteristic function φ with φ(x) = 0 for |x| ≥ τ admits a representation of the form φ(x) = ∫ u(y)u(y + x) dy, x ∈ R, where the convolution root u ∈ L2(R) is complex-valued with u(x) = 0 for |x| ≥ τ/2. The result can be expressed equivalently as a factorization theorem for entire functions of finite exponential type. This paper examin...
متن کاملCompact Support FDK Kernel Reconstruction Model Base on Approximate Inverse
A novel CT reconstruction model is proposed, and the reconstruction is completed by this kernel-based method. The reconstruction kernel can be obtained by combining the approximate inverse method with the FDK algorithm. The computation of the kernel is moderate, and the reconstruction results can be improved by introducing the compact support version of the kernel. The efficiency and the accura...
متن کاملFrames and Oversampling Formulas for Band Limited Functions
In this article we obtain families of frames for the space Bω of functions with band in [−ø, ø] by using the theory of shift-invariant spaces. Our results are based on the Gramian analysis of A. Ron and Z. Shen and a variant, due to Bownik, of their characterization of families of functions whose shifts form frames or Riesz bases. We give necessary and sufficient conditions for the translates o...
متن کاملA Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions
We present a new algorithm for computing the convolution of two compactly supported functions. The algorithm approximates the functions to be convolved using Fourier extensions and then uses the fast Fourier transform to efficiently compute Fourier extension approximations to the pieces of the result. The complexity of the algorithm is O ( N(logN)2 ) , where N is the number of degrees of freedo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.03.013